Near-Optimal Depth-Constrained Codes
نویسندگان
چکیده
منابع مشابه
Ultimate Codes: Near-Optimal MDS Array Codes for RAID-6
As modern storage systems have grown in size and complexity, RAID-6 is poised to replace RAID-5 as the dominant form of RAID architectures due to its ability to protect against double disk failures. Many excellent erasure codes specially designed for RAID-6 have emerged in recent years. However, all of them have limitations. In this paper, we present a class of near perfect erasure codes for RA...
متن کاملNear optimal single-track Gray codes
Single-track Gray codes are a special class of Gray codes which have advantages over conventional Gray codes in certain quantization and coding applications. The problem of constructing high period single-track Gray codes is considered. Three iterative constructions are given, along with a heuristic method for obtaining good seed-codes. In combination, these yield many families of very high per...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملNear-optimal Delay Constrained Routing in Virtual Circuit Networks
1 Correspondence Author Abstract -An essential issue in designing, operating and managing a modern network is to assure end-to-end Quality-ofService (QoS) from users’ perspective, and in the meantime to optimize a certain “average” performance objective from the system’s perspective. In this paper, we consider the problem of minimizing the average cross-network packet delay in virtual circuit n...
متن کاملNear-Optimal Secret Sharing and Error Correcting Codes in AC0
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes. In standard instances of these objects, both encoding and decoding involve linear algebra, and thus cannot be implemented in the class AC. The feasibility of non-trivial secret sharing schemes in AC was recently shown by Bogdanov et al. (Crypto 2016) and that of (local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2004
ISSN: 0018-9448
DOI: 10.1109/tit.2004.838345